package leetcode_1001_1100;

public class LeeCode_1015 {
    public static void main(String[] args) {

    }
    private static int smallestRepunitDivByK(int k) {
        int n = 1;
        if (k % 2 == 0 || k % 5 == 0){
            return -1;
        }
        int i = 1;
        while (n % k != 0){
            n %= k;
            n = n * 10 + 1;
            i++;
        }
        return i;
    }
}
